Burst Correction Coding From Low-Density Parity-Check Codes

نویسنده

  • Wai Han Fong
چکیده

BURST CORRECTION CODING FROM LOW-DENSITY PARITY-CHECK CODES Wai Han Fong, PhD George Mason University, 2015 Dissertation Director: Dr. Shih-Chun Chang Dissertation Co-Director: Dr. Shu Lin This thesis explores techniques and theoretical bounds on efficiently encodable low-density parity-check (LDPC) codes for correcting single and multiple bursts of erasures and/or errors. The approach is to construct good burst correction codes via superposition techniques from smaller constituent codes, such as product codes and/or use existing codes with newer decodings, such as randomly generated LDPC codes with simple recursive erasure decoding. Another goal is to design codes that perform well in a random error environment as well a bursty environment for some channels that change from one state to the other, i.e. a satellite optical link that suffers from fades due to atmospheric scintillation. Novel decoding approaches are explored, i.e. iterative decoding of constituent codes and/or decoding over the entire code. The motivation for this work is the use of multiple burst correction coding for the following types of applications: 1) optical laser communications where atmospheric turbulence create burst errors; 2) wireless communications where fading is created by multipath, or interference from random impulses and jamming; and 3) packet networks where traffic congestion can create erasure bursts from packet losses. Chapter 1: Introduction This thesis is focused on finding new solutions to the classical problem of burst erasure and burst error control for bursty channels. Bursty channels are the result of correlated errors/erasures patterns. Traditional solutions to the this problem involve implementing Reed-Solomon codes. Specifically, this work is focused on exploiting low-density paritycheck (LDPC) codes to solve this problem. Recently, there have been work in this field, [1–3]. We will explore and extend LDPC codes; and apply these codes to multi-dimensional structures, such as product codes and others, as well as use randomly generated LDPC codes in novel approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GTTI 2008: sessione Trasmissione Numerica Non-binary LDPC codes with good performance on channels affected by bursty noise

Non-binary Reed-Solomon (RS) codes represent a typical way to counteract the effects of error bursts in hard-disk drives (HDD). Recently, it has been demonstrated how q-ary low-density paritycheck (LDPC) codes can outperform RS codes through a proper construction of the parity check (PC) matrix. In this work, two matrix design schemes, based on the main definitions of erasure burst proposed in ...

متن کامل

A Modification Method for Constructing Low-Density Parity-Check Codes for Burst Erasures

We study a modification method for constructing lowdensity parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results t...

متن کامل

Performance of Low-Density Parity-Check Codes for Burst Erasure Channels

Performance of low-density parity-check (LDPC) codes with maximum likelihood decoding (MLD) for solid burst erasures is discussed. The columns of the paritycheck matrix of LDPC codes are permuted to increase the distance between elements (DBEs) which are defined as a number of symbol positions between elements 1 at each row of the parity-check matrix. The column permutation method can change th...

متن کامل

2-Stripes Block-Circulant LDPC Codes for Single Bursts Correction

In this paper the low-density parity-check (LDPC) codes are considered applied to correction of error bursts. Errors grouping and forming of so-called bursts are typical effect in real communication and data storage systems, however, this effect is typically ignored, and the coding task is reduced to correction of independent errors, which makes the practical characteristics of coding systems w...

متن کامل

LDPC Codes For The Classic Bursty Channel

In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016